Tunable Least Served First - A New Scheduling Algorithm with Tunable Fairness

At high transmission speeds, complexity of implementation for fair queuing disciplines can impose a bottleneck to the overall system performance. Available scheduling algorithms set a fixed trade off between fairness and complexity, fairer systems involving more operations per packet and vice versa. In this paper first a new fair queuing scheme is proposed, with almost the same fairness and complexity propierties achieved so far by most used algorithms. Later on a tunable parameter is introduced, which allows the modification of the above mentioned trade off between fairness and complexity depending on working conditions and thus enlarging the field of application of the scheduler.